The distinguishing number of the direct product and wreath product action
نویسندگان
چکیده
منابع مشابه
The distinguishing number of the direct product and wreath product action
Let G be a group acting faithfully on a set X . The distinguishing number of the action of G on X , denoted DG(X ), is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a colorpreserving permutation of X . In this paper, we consider the distinguishing number of two important product actions, the wreath product and the direct product. ...
متن کاملDistinguishing Sets under Group Actions, the Wreath Product Action
Definition 1.2 (Distinguishing number of a graph). Let Γ = (V,E) be a graph and let f : V → [r] be a coloring of the set of vertices by r colors. The map f need not be surjective, in fact when r > |V | it cannot be surjective. We say that f is r-distinguishing if the only automorphism of Γ that fixes the coloring f is the trivial automorphism. The distinguishing number of Γ is denoted by D(Γ) a...
متن کاملWreath Product Action on Generalized Boolean Algebras
Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G ∼ Sn on the generalized Boolean algebra BX(n). We explicitly block diagonalize the commutant of this action.
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملWreath Product Symmetric Functions
We systematically study wreath product Schur functions and give a combinatorial construction using colored partitions and tableaux. The Pieri rule and the Littlewood-Richardson rule are studied. We also discuss the connection with representations of generalized symmetric groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2006
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-006-0006-7